Metaheuristic algorithms for the simultaneous slot allocation problem
نویسندگان
چکیده
منابع مشابه
METAHEURISTIC ALGORITHMS FOR MINIMUM CROSSING NUMBER PROBLEM
This paper presents the application of metaheuristic methods to the minimum crossing number problem for the first time. These algorithms including particle swarm optimization, improved ray optimization, colliding bodies optimization and enhanced colliding bodies optimization. For each method, a pseudo code is provided. The crossing number problem is NP-hard and has important applications in eng...
متن کاملSlot Allocation Algorithms 1 Running head: SLOT ALLOCATION ALGORITHMS SLOT ALLOCATION ALGORITHMS FOR MINIMIZING DELAY IN ALARM-DRIVEN WSNS APPLICATIONS
Energy-efficiency and latency requirements in alarm-driven Wireless Sensor Networks often demand the use of TDMA protocols with special features such as cascading of timeslots, in a way that the sensor-to-sink delay bound can stay below the duration of a single frame. However, this single TDMA frame should be as small as possible. The results presented in this paper, point to the conclusion tha...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولHybrid Population-based Metaheuristic Approaches for the Space Allocation Problem
† The author acknowledges support from Universidad Autonoma de Chihuahua and PROMEP in Mexico. ABSTRACT. A hybrid population-based metaheuristic for the space allocation problem in academic institutions is presented that is based upon previous experiments using a range of techniques including hill-climbing, simulated annealing, tabu search and genetic algorithms. The proposed approach incorpora...
متن کاملHybrid metaheuristic algorithms for the tardiness blocking flow shop problem
This paper proposes an Iterated Local Search (ILS) procedure and an Iterated Greedy (IG) algorithm, which are both combined with a variable neighbourhood search (VNS), for dealing with the flow shop problem with blocking, in order to minimize the total tardiness of jobs. The structure of both algorithms is very similar, but they differ in the way that the search is diversified in the space of s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IET Intelligent Transport Systems
سال: 2012
ISSN: 1751-956X,1751-9578
DOI: 10.1049/iet-its.2011.0179